Method of decoding a data word

ABSTRACT

A method of decoding a received data word (r) having been transmitted over a radio communication channel, the corresponding sent data word (m) having been encoded as a code word (c), the method includes: 
     multiplying of the received data word by a parity-check matrix, 
     and if the result of the multiplication is zero: performing an algebraic decoding of the received data word without error correction, otherwise performing an error correction by estimating the transmission error, subtracting the estimated error from the received data word, and performing an algebraic decoding of the result of the subtraction, wherein for estimation of the transmission error is used to identify an approximate location of potential errors and the Viterbi algorithm is only applied for these locations, thus avoiding iterations in error-free areas.

The invention is based on a priority application EP 03292150.4 which is hereby incorporated by reference.

FIELD OF THE INVENTION

The present invention relates to the field of decoding, and more particularly without limitation, to Viterbi decoding and forward error correction.

BACKGROUND OF THE INVENTION

A commonly used method to decode convolutional codes is the Viterbi algorithm. The Viterbi algorithm essentially performs maximum likelihood decoding; it reduces the computational load by taking advantage of the special structure in the code trellis. The advantage of Viterbi decoding, compared with brute-force decoding, is that the complexity of a Viterbi decoder is not a function of the number of symbols in the code word sequence.

The algorithm involves calculating a measure of similarity, or distance, between the received signal at a certain time and all the trellis paths entering each state at that time. The Viterbi algorithm removes from consideration those trellis paths that could not possibly be candidates for the maximum likelihood choice. When two paths enter the same state, the one having the best metric is chosen; this path is called the surviving path. The early rejection of the unlikely path reduces the decoding complexity. Still the Viterbi algorithm is quite computationally expensive.

Further, the Viterbi convolutional decoding algorithm is used for forward error correction. The purpose of forward error correction (FEC) is to improve the capacity of a channel by adding some redundant information to the data being transmitted through the channel. The process of adding this redundant information is known as channel coding. Convolutional coding is a major form of channel coding. Convolutional codes operate on serial data, one or a few bits at a time. Convolutional encoding with Viterbi decoding is a FEC technique that is particularly suited to a radio communication channel.

The present invention aims to provide an improved method of decoding of a received data word.

SUMMARY OF THE INVENTION

These and other objects of the present invention are solved basically by applying the features laid down in the respective independent claims. Preferred embodiments of the invention are given in the dependant claims.

The present invention is first based on the fact that error corrective decoding is not always required when a data word is received. In order to determine whether error corrective decoding is or is not required, it is checked whether a received data word is error free (or has undetectable errors) or if the information message has no chance to be recovered, i.e. there are too many errors in the received data words.

If the received data word has no errors or undetectable errors decoding is performed without prior error correction. If the information message is not recoverable, the frame is rejected before decoding.

Yet, in most cases, the frames will have to be decoded. In these cases, the complexity reduction is achieved by performing the FEC in a much more efficient way than the classical decoding: the Viterbi algorithm is used to estimate the transmission errors rather than the information message. With this type of decoding, a vast majority of state to state iterations can be avoided in the error-free zones.

This approach has the advantage that computationally expensive error correction procedures can be prevented in case a determination is made for the received data word that it has no error, undetectable errors or too many errors.

This approach also has the advantage that when the FEC is required, some significant complexity reduction is achieved by avoiding a vast majority of state to state iterations during the Viterbi decoding

One way of determining whether error correction is required or not is based on the parity-check matrix. The parity-check matrix is also referred to as check-matrix or control matrix in coding theory. A parity-check matrix H for a code C having a generator matrix G satisfies GH^(t)=0 as it is as such known in the prior art.

In accordance with a preferred embodiment of the invention the parity-check matrix is calculated once for a given encoding scheme and stored in the receiver. When a data word is received it is multiplied by the pre-calculated parity-check matrix in order to determine whether error correction is required or not.

In accordance with a further preferred embodiment of the invention the result of the multiplication of the received data word by the parity-check matrix is used in order to determine whether error correction is required or not.

-   -   If the number of non-null coefficients of the result of the         multiplication of the received data word by the parity-check         matrix is equal to zero, the received data word is error-free         (or the error is not detectable) and the error correction is not         required.     -   If the number of non-null coefficients of the result of the         multiplication of the received data word by the parity-check         matrix is above a certain threshold level, no error correction         and no decoding is performed as the received data word is         considered uncorrectable. This has the advantage that useless         processing of the uncorrectable data word is avoided.

Otherwise, if the FEC has to be performed, the classical Viterbi algorithm can be used to estimate the original information message.

Yet, if the FEC has to be performed, the Viterbi algorithm can be used to estimate the transmission errors rather than the information message. The result of the multiplication of the received data word by the parity-check matrix gives an approximate location of potential errors and the Viterbi algorithm is only applied in these identified zones, thus avoiding many iterations in the error-free area.

Finally the estimated transmission errors are subtracted to the received data word and an algebraic decoding is performed to evaluate the sent information message.

The determination whether error correction is required or not and the fast error correction procedure are based on the parity-check matrix works for arbitrary convolutional code rates, such as convolutional code rates of ½, ⅓, 2/3 (see further examples below). Yet, in the case of a convolutional code of rate ½, some simple polynomial manipulations can also lead to the result of the multiplication of the received data word by the parity-check matrix. Indeed, it can be shown that, in case of a convolutional code rate of 1/2 the result of the received data word multiplied by the parity check matrix can be also obtained by using the simple polynomial manipulations described in annex 3.

BRIEF DESCRIPTION OF THE DRAWINGS

In the following preferred embodiments of the invention will be described in greater detail by making reference to the drawings in which:

FIG. 1 is a block diagram of a telecommunication system,

FIG. 2 is illustrative of a flow chart showing an embodiment of a method of the invention.

DETAILED DESCRIPTION OF THE INVENTION

FIG. 1 shows a telecommunication system having a sender 1 for sending of information messages m₁, m₂, . . . , m_(k) to a receiver 2 over channel 3. Sender 1 has encoder 4 for encoding of the information messages by means of a generator polynomials matrix G={g_(ij)} to provide encoded words c₁, c₂, . . . , c_(n). It is to be noted that the number of information messages k and the number n of encoded words can be arbitrary, i.e. the system works for various convolutional code rates k/n.

The encoded words c₁, c₂, . . . , c_(n), are transmitted over noisy channel 3. The transmission over noisy channel 3 results in the addition of errors e₁, e₂, . . . , e_(n). As a consequence receiver 2 receives messages r₁, r₂, . . . , r_(n), where

$\begin{matrix} {r_{1} = {c_{1} + e_{1}}} \\ {r_{2} = {c_{2} + e_{2}}} \\ \cdots \\ {r_{n} = {c_{n} + e_{n}}} \\ {with} \\ {c_{1} = {{g_{11}m_{1}} + {g_{12}m_{2}} + \ldots + {g_{1k}m_{k}}}} \\ {c_{2} = {{g_{21}m_{1}} + {g_{22}m_{2}} + \ldots + {g_{2k}m_{k}}}} \\ \cdots \\ {c_{n} = {{g_{n\; 1}m_{1}} + {g_{n\; 2}m_{2}} + \ldots + {g_{nk}m_{k}}}} \end{matrix}$

Decoder 5 of receiver 2 has an error correction capability in order to eliminate the error vector {e₁, e₂, . . . , e_(n)} from the received messages to provide the original information messages.

It can be mathematically shown that the above system of n equations and k unknown polynomials, i.e. m₁, m₂, . . . , m_(k), can be divided into:

-   -   k required equations to find the k unknown polynomials m₁, m₂, .         . . , m_(k) by an algebraic decoding. For instance

$\left. \begin{matrix} {c_{1} = {{g_{11}m_{1}} + {g_{12}m_{2}} + \ldots + {g_{1k}m_{k}}}} \\ {c_{2} = {{g_{21}m_{1}} + {g_{22}m_{2}} + \ldots + {g_{2k}m_{k}}}} \\ \cdots \\ {c_{k} = {{g_{k\; 1}m_{1}} + {g_{k\; 2}m_{2}} + \ldots + {g_{kk}m_{k}}}} \end{matrix}\rightarrow\begin{matrix} {m_{1} = {{p_{11}c_{1}} + {p_{12}c_{2}} + \ldots + {p_{1k}c_{k}}}} \\ {m_{2} = {{p_{21}c_{1}} + {p_{22}c_{2}} + \ldots + {p_{2k}c_{k}}}} \\ \cdots \\ {m_{k} = {{p_{k\; 1}c_{1}} + {p_{k\; 2}c_{2}} + \ldots + {p_{kk}c_{k}}}} \end{matrix} \right.$

-   -   where the polynomials p_(ij) are linear combinations of the         generator polynomials.     -   n−k “control equations”, independent on m₁, m₂, . . . , m_(k):

$\begin{matrix} {{{c_{1}h_{11}} + {c_{2}h_{21}} + \ldots + {c_{n}h_{n\; 1}}} = 0} \\ {{{c_{1}h_{12}} + {c_{2}h_{22}} + \ldots + {c_{n}h_{n\; 2}}} = 0} \\ \cdots \\ {{{c_{1}h_{1,{n - k}}} + {c_{2}h_{22}} + \ldots + {c_{n}h_{n,{n - k}}}} = 0} \end{matrix}$

-   -   where the polynomials h_(ij) are linear combinations of the         generator polynomials. Examples of polynomials h_(ij) are         provided in annex 1. These n−k control equations can be         expressed with one matrix equation. This equation is referred to         as “control equation” in the following:

${{CH}^{t} = 0},{C^{t} = \begin{pmatrix} c_{1} \\ c_{2} \\  \cdot \\  \cdot \\ c_{n} \end{pmatrix}},{H^{t} = \begin{pmatrix} {h_{11}h_{12}\mspace{14mu}\ldots\mspace{14mu} h_{1,{n - k}}} \\ {h_{21}h_{22}\mspace{14mu}\ldots\mspace{14mu} h_{2,{n - k}}} \\ \; \\ \; \\ {h_{n\; 1}h_{n\; 2}\mspace{14mu}\ldots\mspace{14mu} h_{n,{n - k}}} \end{pmatrix}}$

-   -   It can be theoretically show that there is at least one matrix H         such as:     -   C is a code word         CH^(t)=0     -   H or H′ is commonly referred to as parity-check matrix.

For complexity reason (cf annex 2), it is preferable to choose parity check matrix with minimal degree. Let us call q_(ik) the degree of the polynomial k_(ik)(x); if the generating polynomials verify the following property: {g _(ij)(x); 1≦i≦N} have no common factor for all j.  (1)

Then it can be shown that there exists a set of polynomials {h_(ik)} such as

${\sum\limits_{k = 1}^{N - K}\; q_{k}} = {{M - {1\mspace{14mu}{where}\mspace{14mu} q_{k}}} = {\underset{1 \leq i \leq N}{Max}\left( q_{ik} \right)}}$ and M is the constraint length of the code (maximal length of the generating polynomials). These polynomials are found by searching the polynomials h_(ik)(x) with minimal degree witch verify the system H(x)·G′(x)=0.

It is to be noted that if property (1) is not verified for one column j, it is possible to achieve a code with a minimal memory by dividing this column by the Highest Common Factor of the polynomials {g_(ij)(x); 1≦i≦N}.

The control equation is used to estimate the error vectors. Let E′=(e′₁, . . . , e′_(n))^(t) the total error estimation vector and R=(r₁, . . . , r_(n))^(t) the total information message vector.

The corresponding decoding method is illustrated in FIG. 2 by way of example:

In step 20 a data word is received by the receiver. In step 21 the data word is multiplied by the parity-check matrix. In step 22 it is determined whether all coefficients of the result of the multiplication are equal to zero. If this is the case the control goes to step 23 where the received data word is decoded without error correction.

Otherwise the control goes to step 24 where it is determined whether the number of non-zero coefficients of the result of the multiplication is below a predefined threshold level. If this is the case an error correction of the received data word is performed in step 25 in order to eliminate the error vector. Next the error corrected data word is decoded in step 26.

If it is determined in step 24, that the number of non-zero coefficients of the results of the multiplication is above a predefined threshold level the control goes to step 27 where it is decided that the data word is uncorrectable.

This method implements the algorithm as illustrated below:

-   -   1. calculate RH^(t)     -   2. if the number of non null coefficients of RH^(t) is superior         to a predetermined threshold reject the frame, go to 4.         -   else         -   if RH^(t) is null:             E′=0, go to 3.         -   else             -   use the fast Forward Error Correction algorithm                 described in annex 2 to find E′ such as:             -   1. (R+E′)H^(t)=0             -   2. E′ has the minimal weight (maximum likelihood) go to                 3.     -   3. algebraic decoding, e.g. solve a linear system to estimate         the polynomials m₁, m₂, . . . , m_(k), for example:

$\begin{matrix} {r_{1} = {{g_{11}m_{1}} + {g_{12}m_{2}} + \ldots + {g_{1k}m_{k}} + e_{1}^{\prime}}} \\ {r_{2} = {{g_{21}m_{1}} + {g_{22}m_{2}} + \ldots + {g_{2k}m_{k}} + e_{2}^{\prime}}} \\ \cdots \\ {r_{k} = {{g_{k\; 1}m_{1}} + {g_{k\; 2}m_{2}} + \ldots + {g_{kk}m_{k}} + e_{k}^{\prime}}} \end{matrix}$

-   -   4. end

The complexity reduction is obtained at several steps:

-   -   If the estimated frame error probability (connected to the         number of non-null coefficients of RH^(t)) is superior to a         predetermined threshold, the frame has a very low probability to         be recovered. It is rejected before the decoding.     -   If RH^(t) is null, the raw bit error rate is equal to zero, or         the error is undetectable, and the FEC is not performed.     -   When the frame has to be decoded, RH^(t) is used to reduce the         decoding complexity. The Viterbi Algorithm is applied to         estimate the error vector instead of the information message         (annex 2). In this case, some iteration, shown to be         unnecessary, can be avoided (annex 2).

With the proposed algorithm, almost optimal performance is achievable with an order of magnitude in complexity reduction. The following figures show the complexity reduction and the performances degradation for two convolutional codes of rate 1/3 and 2/3 in both the hard decoder input case and the soft decoder input case. The complexity criteria is the percentage of “Add Compare Select (ACS)” operations performed compared to the number of ACS of the classical Viterbi. Performance criteria is the Frame Error Rate (FER) at the decoder output.

Convolutional code of rate ⅓:

$\begin{matrix} {{g_{11}(x)} = {1 + x^{2} + x^{3}}} & \; \\ {{g_{21}(x)} = {1 + x + x^{3}}} & {H^{t} = \begin{pmatrix} x & {1 + x^{2}} \\ 1 & {1 + x^{2}} \\ {1 + x} & x \end{pmatrix}} \\ {{g_{31}(x)} = {1 + x + x^{2} + x^{3}}} & \; \end{matrix}$ G = (1 + x² + x³   1 + x + x³   1 + x + x² + x³)

As shown in FIGS. 3A, and 3B, in both the hard and the soft cases, when the SNR is superior to 3.5 db, less than 10% of the ACS are required. Furthermore, the maximal number of required ACS remains inferior to 43% (resp. 65%) in the hard (resp. soft) case. The performances degradation remains inferior to 0.5 db in both cases.

Convolution code of rate ⅔:

$\quad\left\{ \begin{matrix} \begin{matrix} {{g_{11}(x)} = {1 + x}} \\ {{g_{21}(x)} = x} \\ {{g_{31}(x)} = {1 + x}} \\ {{g_{12}(x)} = x} \\ {{g_{22}(x)} = 1} \\ {{g_{32}(x)} = 1} \end{matrix} & {H^{t} = \begin{pmatrix} 1 \\ {1 + x^{2}} \\ {1 + x + x^{2}} \end{pmatrix}} & {G = \begin{pmatrix} {1 + x} & x & {1 + x} \\ x & 1 & 1 \end{pmatrix}} \end{matrix} \right.$

As shown in FIGS. 4A and 4B, in both the hard and the soft cases, when the SNR is superior to 4 db, less than 10% of the ACS are required. Furthermore, the maximal number of required ACS remains inferior to 12% (resp. 27%) in the hard (resp. soft) case. The performances degradation remains inferior to 0.5 db (resp. 0.3 db) in the hard (resp. soft) case.

List of Reference Numerals 1 sender 2 receiver 3 channel 4 encoder 5 decoder 200 receiver 202 program module 204 program module 208 program module 209 program module 212 program module Annex 1: Examples of Control Matrix

In the following a polynomial “p(X)” is called “p”.

Since all the polynomials p have their coefficients in the {0,1}we always have: p+p=0 1/2 convolutional codes:

$\begin{matrix} \left\{ \begin{matrix} {C_{1} = {g_{1}m_{1}}} \\ {C_{2} = {g_{2}m_{1}}} \end{matrix} \right. \\ \left. \Leftrightarrow\left\{ \begin{matrix} {{g_{2}C_{1}} = {g_{2}g_{1}m_{1}}} \\ {{g_{1}C_{2}} = {g_{1}g_{2}m_{1}}} \end{matrix} \right. \right. \\ {\left. \Rightarrow{{g_{2}C_{1}} + {g_{1}C_{2}}} \right. = {{g_{2}g_{1}m_{1}} + {g_{2}g_{1}m_{1}}}} \\ {\left. \Rightarrow{{g_{2}C_{1}} + {g_{1}C_{2}}} \right. = 0} \\ {{{CH}^{t} = 0},{C^{t} = \begin{pmatrix} C_{1} \\ C_{2} \end{pmatrix}},{H^{t} = \begin{pmatrix} g_{2} \\ g_{1} \end{pmatrix}}} \end{matrix}$ 3/5 convolutional codes:

$\begin{matrix} \left\{ \begin{matrix} {C_{1} = {{g_{11}m_{1}} + {g_{12}m_{2}} + {g_{13}m_{3}}}} \\ {C_{2} = {{g_{21}m_{1}} + {g_{22}m_{2}} + {g_{23}m_{3}}}} \\ {C_{3} = {{g_{31}m_{1}} + {g_{32}m_{2}} + {g_{33}m_{3}}}} \\ {C_{4} = {{g_{41}m_{1}} + {g_{42}m_{2}} + {g_{43}m_{3}}}} \\ {C_{5} = {{g_{51}m_{1}} + {g_{52}m_{2}} + {g_{53}m_{3}}}} \end{matrix} \right. \\ \left. \Leftrightarrow\left\{ \begin{matrix} {C_{1} = {{g_{11}m_{1}} + {g_{12}m_{2}} + {g_{13}m_{3}}}} \\ {{{g_{21}C_{1}} + {g_{11}C_{2}}} = {{\left( {{g_{11}g_{22}} + {g_{12}g_{21}}} \right)m_{2}} + {\left( {{g_{21}g_{13}} + {g_{23}g_{11}}} \right)m_{3}}}} \\ {{{g_{31}C_{1}} + {g_{11}C_{3}}} = {{\left( {{g_{11}g_{32}} + {g_{12}g_{31}}} \right)m_{2}} + {\left( {{g_{31}g_{13}} + {g_{33}g_{11}}} \right)m_{3}}}} \\ {{{g_{41}C_{1}} + {g_{11}C_{4}}} = {{\left( {{g_{11}g_{42}} + {g_{12}g_{41}}} \right)m_{2}} + {\left( {{g_{41}g_{13}} + {g_{43}g_{11}}} \right)m_{3}}}} \\ {{{g_{51}C_{1}} + {g_{51}C_{3}}} = {{\left( {{g_{11}g_{52}} + {g_{12}g_{51}}} \right)m_{2}} + {\left( {{g_{51}g_{13}} + {g_{53}g_{11}}} \right)m_{3}}}} \end{matrix} \right. \right. \\ \left. \Leftrightarrow\left\{ \begin{matrix} {C_{1} = {{G_{11}m_{1}} + {G_{12}m_{2}} + {G_{13}m_{3}}}} \\ {{{g_{21}C_{1}} + {g_{11}C_{2}}} = {{G_{22}m_{2}} + {G_{23}m_{3}}}} \\ {{{\left( {{g_{31}C_{1}} + {g_{11}C_{3}}} \right)\left( G_{22} \right)} + {\left( G_{32} \right)\left( {{g_{21}C_{1}} + {g_{11}C_{2}}} \right)}} = {G_{33}m_{3}}} \\ {{{\left( {{g_{41}C_{1}} + {g_{11}C_{4}}} \right)\left( G_{22} \right)} + {\left( G_{42} \right)\left( {{g_{21}C_{1}} + {g_{11}C_{2}}} \right)}} = {G_{43}m_{3}}} \\ {{{\left( {{g_{51}C_{1}} + {g_{11}C_{5}}} \right)\left( G_{22} \right)} + {\left( G_{52} \right)\left( {{g_{21}C_{1}} + {g_{11}C_{2}}} \right)}} = {G_{53}m_{3}}} \end{matrix} \right. \right. \end{matrix}$ with:

$\left. \begin{matrix} {{G_{11} = g_{11}};{G_{12} = g_{12}};{G_{12} = g_{12}}} \\ {{G_{22} = {{g_{11}g_{22}} + {g_{12}g_{21}}}};{G_{23} = {{g_{21}g_{13}} + {g_{23}g_{11}}}}} \\ {{G_{32} = {{g_{11}g_{32}} + {g_{12}g_{31}}}};{G_{42} = {{g_{11}g_{42}} + {g_{12}g_{41}}}};{G_{52} = {{g_{11}g_{52}} + {g_{12}g_{51}}}}} \\ {G_{33} = {{\left( {{g_{11}g_{22}} + {g_{12}g_{21}}} \right)\left( {{g_{31}g_{13}} + {g_{33}g_{11}}} \right)} + {\left( {{g_{21}g_{13}} + {g_{23}g_{11}}} \right)\left( {{g_{11}g_{32}} + {g_{12}g_{31}}} \right)}}} \\ {G_{43} = {{\left( {{g_{11}g_{22}} + {g_{12}g_{21}}} \right)\left( {{g_{41}g_{13}} + {g_{43}g_{11}}} \right)} + {\left( {{g_{21}g_{13}} + {g_{23}g_{11}}} \right)\left( {{g_{11}g_{42}} + {g_{12}g_{41}}} \right)}}} \\ {G_{53} = {{\left( {{g_{11}g_{22}} + {g_{12}g_{21}}} \right)\left( {{g_{51}g_{13}} + {g_{53}g_{11}}} \right)} + {\left( {{g_{21}g_{13}} + {g_{23}g_{11}}} \right)\left( {{g_{11}g_{52}} + {g_{12}g_{51}}} \right)}}} \end{matrix}\Leftrightarrow\left\{ \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} {C_{1} = {{G_{11}m_{1}} + {G_{12}m_{2}} + {G_{13}m_{3}}}} \\ {{{g_{21}C_{1}} + {g_{11}C_{2}}} = {{G_{22}m_{2}} + {G_{23}m_{3}}}} \end{matrix} \\ {{{\left( {{g_{31}C_{1}} + {g_{11}C_{3}}} \right)\left( G_{22} \right)} + {\left( G_{32} \right)\left( {{g_{21}C_{1}} + {g_{11}C_{2}}} \right)}} = {G_{33}m_{3}}} \end{matrix} \\ {{{\left( {{\left( {{g_{41}C_{1}} + {g_{11}C_{4}}} \right)\left( G_{22} \right)} + {\left( G_{42} \right)\left( {{g_{21}C_{1}} + {g_{11}C_{2}}} \right)}} \right)G_{33}} + {\left( {{\left( {{g_{31}C_{1}} + {g_{11}C_{3}}} \right)\left( G_{22} \right)} + {\left( G_{32} \right)\left( {{g_{21}C_{1}} + {g_{11}C_{2}}} \right)}} \right)G_{43}}} = 0} \end{matrix} \\ {{{\left( {{\left( {{g_{51}C_{1}} + {g_{11}C_{5}}} \right)\left( G_{22} \right)} + {\left( G_{52} \right)\left( {{g_{21}C_{1}} + {g_{11}C_{2}}} \right)}} \right)G_{33}} + {\left( {{\left( {{g_{31}C_{1}} + {g_{11}C_{3}}} \right)\left( G_{22} \right)} + {\left( G_{32} \right)\left( {{g_{21}C_{1}} + {g_{11}C_{2}}} \right)}} \right)G_{53}}} = 0} \end{matrix}\Rightarrow\left\{ {\begin{matrix} {{{\left( {{\left( {{g_{41}G_{22}} + {g_{21}G_{42}}} \right)G_{33}} + {\left( {{g_{31}G_{22}} + {g_{21}G_{32}}} \right)G_{43}}} \right)C_{1}} + {\left( {{g_{11}G_{42}G_{33}} + {g_{11}G_{32}G_{43}}} \right)C_{2}} + {\left( {g_{11}G_{22}G_{43}} \right)C_{3}} + {\left( {g_{11}G_{22}G_{33}} \right)C_{4}} + {(0)C_{5}}} = 0} \\ {{{\left( {{\left( {{g_{51}G_{22}} + {g_{21}G_{52}}} \right)G_{33}} + {\left( {{g_{31}G_{22}} + {g_{21}G_{52}}} \right)G_{53}}} \right)C_{1}} + {\left( {{g_{11}G_{52}G_{33}} + {g_{11}G_{32}G_{53}}} \right)C_{2}} + {\left( {g_{11}G_{22}G_{53}} \right)C_{3}} + {(0)C_{4}} + {\left( {g_{11}G_{22}G_{33}} \right)C_{5}}} = 0} \end{matrix}\begin{matrix} {{CH}^{t} = 0} \\ {H = \begin{pmatrix} {{\left( {{g_{41}G_{22}} + {g_{21}G_{42}}} \right)G_{33}} + {\left( {{g_{31}G_{22}} + {g_{21}G_{32}}} \right)G_{43}}} & {{g_{11}G_{42}G_{33}} + {g_{11}G_{32}G_{43}}} & {g_{11}G_{22}G_{43}} & {g_{11}G_{22}G_{33}} & 0 \\ {{\left( {{g_{51}G_{22}} + {g_{21}G_{52}}} \right)G_{33}} + {\left( {{g_{31}G_{22}} + {g_{21}G_{52}}} \right)G_{53}}} & {{g_{11}G_{52}G_{33}} + {g_{11}G_{32}G_{53}}} & {g_{11}G_{22}G_{53}} & 0 & {g_{11}G_{22}G_{33}} \end{pmatrix}} \\ {C = \begin{pmatrix} C_{1} & C_{2} & C_{3} & C_{4} & C_{5} \end{pmatrix}} \end{matrix}} \right. \right. \right.$ Annex 2: Fast Forward Error Correction (Hard Decoder Input Case)

We hove to find the

${e^{\prime}(x)} = {\sum\limits_{i = 1}^{N}{x^{i - 1}{e_{1}^{\prime}\left( x^{N} \right)}}}$ word with minimal weight such as

${H(x)} \cdot {\quad\begin{pmatrix} {{r_{1}(x)} + {e_{1}^{\prime}(x)}} \\ \cdots \\ {{r_{N}(x)} + {e_{N}^{\prime}(x)}} \end{pmatrix}}$ is null. We can mathematically show the following equivalence:

${H(x)} \cdot {\quad{\begin{pmatrix} {{r_{1}(x)} + {e_{1}^{\prime}(x)}} \\ \begin{matrix} \cdots \\ \cdots \end{matrix} \\ {{r_{N}(x)} + {e_{N}^{\prime}(x)}} \end{pmatrix} = {{E(x)} = \left. \begin{pmatrix} 0 \\ \cdots \\ 0 \end{pmatrix}\Leftrightarrow{{r(x)} + {e^{\prime}(x)}} \right.}}}$ is a codeword with

${E(x)} = {\quad\begin{pmatrix} {E_{1}(x)} \\ \cdots \\ {E_{N - K}(x)} \end{pmatrix}}$

The search of e′(x) can be done by using the Viterbi Algorithm to cancel the matrix E(x)

${{E_{j}(x)} = {\sum\limits_{i}{E_{j,i}x^{i}}}};{1 \leq j \leq {N - K}}$

The trellis used in the Viterbi Algorithm is constituted of nodes corresponding to distinct states. These nodes are connected by branches. A succession of branches is called a path and a path is characterized by a metric.

States

There are 2^(M−1) states, where M−1 is the memory of the code. A matrix E^(S) ^(k) (x) is associated with each state S_(k). The value of the state S_(k) at time n is given by the M−1 elements of the matrix E^(S) ^(k) (x) as follows:

${{E_{j}^{S_{k}}(x)} = {\sum\limits_{i}{E_{j,i}^{S_{k}}x^{i}}}};{1 \leq j \leq {N - K}}$ $S_{k} = {\begin{Bmatrix} V_{1} & V_{2} & \ldots & V_{N - K} \end{Bmatrix}\mspace{14mu}{with}}$ $\left\{ \begin{matrix} {V_{j} = \left\{ {E_{j,n}^{S_{k}},E_{j,{n + 1}}^{S_{k}},\ldots\mspace{14mu},E_{j,{n + {Mj} - 2}}^{S_{k}}} \right\}} \\ {{Mj} = {\max\limits_{i}\left( {{degree}\mspace{14mu}{of}\mspace{14mu}{hij}} \right)}} \end{matrix} \right.$

The initial state S_(k,0) is associated to E(x).

Branches

A branch represents the transition between one state at time n (current state) and one state at time n+1 (following state). Let us call:

e_(i, n)^(′):  coefficient  n  of  e_(i)^(′)

A set of coefficient

{e_(1, n)^(′), …  , e_(N, n)^(′)} is associated to each branch. At time n, one builds the set {Z_(i)(x)} of sequences

${{Z_{i}(x)} = {{{{H(x)} \cdot \begin{pmatrix} \begin{matrix} \begin{matrix} e_{1,n}^{\prime} \\ \ldots \end{matrix} \\ \ldots \end{matrix} \\ e_{N,n}^{\prime} \end{pmatrix}}\mspace{14mu} x^{n}} = {{\begin{pmatrix} \begin{matrix} Z_{1,i} \\ \ldots \end{matrix} \\ Z_{{N - K},i} \end{pmatrix}\mspace{14mu}{with}\mspace{14mu}{Z_{j,i}(x)}} = {\sum\limits_{l = 0}^{{Mj} - 1}{Z_{j,i}^{l}x^{n + l}}}}}};$ 1 ≤ i ≤ 2^(n) where the first coefficient Z_(j,i) ⁰ satisfies the condition:

Z_(j, i)⁰ = E_(j, n)^(Sk)  for  1 ≤ j ≤ N − K

Let S_(k) be the current state at time n, let S_(i) be S_(k) following state (at time n+1) and let E^(S) ^(i) be the associated polynomial. We have:

$\begin{matrix} {{E_{j}^{S_{i}}(x)} = {{{E_{j}^{S_{k}}(x)} + {{Z_{j,i}(x)}\mspace{14mu}{for}\mspace{14mu} 1}} \leq j \leq {N - K}}} \\ {S_{i} = {\left\{ {V_{1}V_{2}\mspace{14mu}\ldots\mspace{14mu} V_{N - K}} \right\}\mspace{14mu}{with}\mspace{14mu}\left\{ \begin{matrix} {V_{j} = \left\{ {{E_{j,n}^{S_{k}} + Z_{j,1}^{i}},{E_{j,{n + 1}}^{S_{k}} + Z_{j,2}^{i}},\ldots\mspace{11mu},} \right.} \\ \left. \mspace{140mu}{E_{j,{n + {Mj} - 2}}^{S_{k}} + Z_{j,{{Mj} - 1}}^{i}} \right\} \\ {{Mj} = {\max\limits_{i}\left( {{degree}\mspace{14mu}{of}\mspace{14mu}{hij}} \right)}} \end{matrix} \right.}} \end{matrix}$

This procedure leads to an iterative cancellation of the matrix E^(S) s k.

Metrics

The principle of the proposed decoding technique is to find the sequence e′(x) of minimum weight which cancels the matrix E(x). It leads to define the branch metric at time n by:

${\Delta(n)} = {\sum\limits_{i = 1}^{N}\; e_{i,n}^{\prime}}$

Remark: in the soft case we have

${\Delta(n)} = {\sum\limits_{i = 1}^{N}\;{{R_{i,n}}e_{i,n}^{\prime}}}$ where the R_(i,n) are the received soft symbols. The path metric mk(n) is the accumulation of the branch metrics. When several paths come to the same state, the survivor is the one with the smallest path metric. At the end of the procedure, the survivor path is the one terminating in the state S0={0 0 . . . 0}, which is the unique state having all the elements of E^(S) ^(k) (x) to be null. All the set {e_(1,n)′, . . . , e_(N,n)′} associated to each branch of the survivor constitute the decoded error vector e′(x).

${e^{\prime}(x)} = {\sum\limits_{n}^{\;}\;{\left( {\sum\limits_{i = 1}^{N}\;{x^{i - 1}e_{i,n}^{\prime}}} \right)x^{Nn}}}$ “FEC Useless” Zone

If at one step denoted n₀ the properties (P1) and (P2) are both satisfied, then it is unnecessary to carry on the Viterbi Algorithm. The survivor path is the one which reaches the state S0={0 0 . . . 0} at the iteration n₀ and which remains in this state S0 after this node. E ^(S) ⁰ (x)={0,0, . . . ,0} for all j 1≦j≦N−K  (P1) m _(k)(n ₀)≧m ₀(n ₀) for k≠0  (P2)

Furthermore, let us assume that, at time n−n1, condition (P2) is satisfied and that all the vectors E_(j) ^(S) ^(k) (x) verify:

$\begin{matrix} {\left\{ {E_{j,0}^{S_{k}},E_{j,1}^{S_{k}},\ldots\mspace{11mu},E_{j,{n - {n\; 1} - 1}}^{S_{k}}} \right\} = \left\{ {0,0,\ldots\mspace{11mu},0} \right\}} \\ {\left\{ {E_{j,{n - {n\; 1}}}^{S_{k}},E_{j,{n - {n\; 1} + 1}}^{S_{k}},\ldots\mspace{11mu},E_{j,{n - {n\; 1} + {Mj} - 2}}^{S_{k}}} \right\} = V_{j}} \\ {\left\{ {E_{j,{n - {n\; 1} + {Mj} - 1}}^{S_{k}},E_{j,{n - {n\; 1} + {Mj}}}^{S_{k}},\ldots\mspace{11mu},E_{j,n}^{S_{k}}} \right\} = \left\{ {0,0,\ldots\mspace{11mu},0} \right\}} \\ {E_{j,{n + 1}}^{S_{k}} = 1} \end{matrix}$

This configuration can occur if there are at least n1 successive zeros in E(x). Then we can theoretically show that it is unnecessary to carry on the Viterbi Algorithm between step n−n1 and n−M+1 if n1 is superior to a certain threshold which depends on the coder. The Viterbi Algorithm is restarted at step n−M+1 with S₀ as initial state.

Remark: in the soft case the Viterbi algorithm has to be restarted at step n−A+1 where the choice of A results from a trade-off between complexity reduction and performances degradation.

Final Estimation

The final decoded information sequence m′(x) is given by an algebraic decoding of the codeword r(x)+e′(x).

Annex 3: Proof

Convolutional codes of rate ½:

m(x): information word

g₁(x),g₂(x) generator polynomials

C₁(x)=m(x)·g₁(x): code-word from polynomial g1,

C₂(x)=m(X)·g₂(x): code-word from polynomial g2,

r₁(x)=C₁(x)+e₁(x): received word 1,

r₂(x)=C₂(x)+e₂(x): received word 2.

Using the Parity Check Matrix:

Minimal Parity check Matrix:

$H^{t} = \begin{pmatrix} g_{2} \\ g_{1} \end{pmatrix}$

For any code word

$C^{t} = \begin{pmatrix} C_{1} \\ C_{2} \end{pmatrix}$ we have: CH^(t)=0

If we call R^(t)=(r₁ r₂) the total received data word we have:

$\begin{matrix} {{R.H^{t}} = {\left( {r_{1}\mspace{14mu} r_{2}} \right)\begin{pmatrix} g_{2} \\ g_{1} \end{pmatrix}}} \\ {{R.H^{t}} = {\left( {C_{1} + {e_{1}\mspace{31mu} C_{2}} + e_{2}} \right)\begin{pmatrix} g_{2} \\ g_{1} \end{pmatrix}}} \\ {{R.H^{t}} = {0 + {e_{1}g_{2}} + {e_{2}g_{1}}}} \\ {{R.{H^{t}(x)}} = {{{e_{1}(x)}{g_{2}(x)}} + {{e_{2}(x)}{g_{1}(x)}}}} \end{matrix}$ Using Simple Polynomial Manipulations: . . .

We call G the equivalent generator polynomial and C the total resulting code word defined by: G(x)=g ₁(x ²)+x·g ₂(x ²) C(x)=C ₁(x ²)+x·C ₂(x ²)=m(x ²)·G(x)

We can show that C(x)G(x) is an even polynomial: C(x)·G(x)=m(x ²)·G(x)·G(x)=m(x ²)·G(x ²) if we call e(x) the error polynomial and r(x) the received polynomial defined by e(x)=e ₁(x ²)+x·e ₂(x ²⁾ r(x)=C(x)+e(x) we have: r(x)·G(x)=C(x)·G(x)+e(x)·G(x) r(x)·G(x)=C(x)·G(x)+e₁(x ²)·g ¹(x ²)+x ² ·e ₂(x ²)·g₂(x ²)+x 19 (e ₁(x ²)·g₂(x ²)+e ₂(x ²)·g ₁(x²))

Therefore: Odd {r(x)·G(x)}=e ₁(x ²)·g ₂(x ²)+e ₂(x ²)·g ₁(x ²)=>same coefficient than R·H ^(t)

Finally, the odd part of the polynomial r(x)·G(x) has the same coefficient than the results of the received data word multiplied by the parity check matrix. 

1. A method of decoding a received data word having been transmitted over a radio communication channel, corresponding sent information message having been encoded as a code word, the method comprising: multiplying of the received data word by a parity-check matrix; if the result of the multiplication is zero, performing an algebraic decoding of the received data word without error correction; if the result of the multiplication is not zero, determining whether the received data word is unrecoverable based on a threshold; and storing the decoded received data word.
 2. The method of claim 1, further comprising in case the result of the multiplication is not equal to zero: performing an error correction by estimating the transmission error, subtracting the estimated error from the received data word, and performing an algebraic decoding of the result of the subtraction.
 3. The method of claim 2, wherein the error correction is performed by using a Viterbi type method to find the error such as: (R+E′)H^(t)=0,and E′ has the minimal weight, where E′ is the total error estimation vector, R is the total information message vector, and H is the parity-check matrix.
 4. The method of claim 3, wherein R·H′ is used to identify an approximate location of potential errors and the Viterbi algorithm is only applied for these locations, thus avoiding iterations in error-free areas.
 5. The method of claim 1, wherein the received data word is determined to be unrecoverable in case number of non-null coefficients of the result of the multiplication exceeds a threshold level.
 6. The method of claim 1, wherein a set of polynomials {h_(ik)} is determined by searching the polynomials h_(ik)(x) with minimal degree which verify the system H(x)·G′(x)=0, and wherein G is the generator matrix which consists of the generator polynomials g_(ij), {g_(ij)(x); 1≦i≦N} have no common factor for all j, q_(ik) is the degree of the polynomial h_(ik)(x); the polynomials h_(ik)(x) are linear combinations of generator polynomials g_(ij), and ${\sum\limits_{k = 1}^{N - K}\; q_{k}} = {{M - {1\mspace{14mu}{where}\mspace{14mu} q_{k}}} = {\underset{1 \leq i \leq N}{Max}\mspace{11mu}\left( q_{ik} \right)}}$ and M is the constraint length of the code.
 7. The method of claim 1, wherein a convolutional code rate is k/n, where n and k are arbitrary integer numbers.
 8. The method of claim 1, wherein a convolutional code rate is ½ and the result of received data word multiplied by the parity check matrix is obtained by calculating the odd part of r(x)·G(x), where: m(x): information word, g₁ (x),g₂(x): generator polynomials, G(x)=g₁(x²)+x·g₂(x²): equivalent generator polynomial, C₁(x)=m(x)·g₂(x): code-word from polynomial g1, C₂(x)=m(X)·g₂(x): code-word from polynomial g2, r₁(x)=C₁(x)+e₁(x): received word 1, r₂(x)=C₂(x)+e₂(x): received word 2, and r(x)=r₁(x²)+x·r₂(x²): received polynomial.
 9. A computer readable-medium storing instructions for decoding a received data word having been transmitted over a radio communication channel, the corresponding sent data word having been encoded as a code word, the instructions comprising: multiplying of the received data word by a parity-check matrix, if the result of the multiplication is zero, performing an algebraic decoding of the received data word without error correction; and if the result of the multiplication is not zero, determining whether the received data word is unrecoverable based on a threshold.
 10. A receiver of a radio communication network comprising means for decoding a received data word having been transmitted over a radio communication channel, the corresponding sent data word having been encoded as a code word, and error correction means, the means for decoding being adapted to perform the steps of: multiplying of the received data word by a parity-check matrix; if the result of the multiplication is zero: performing an algebraic decoding of the received data word without error correction; and if the result of the multiplication is not zero, determining whether the received data word is unrecoverable based on a threshold.
 11. The method of claim 1, further comprising when the result of the multiplication is not equal to zero, performing an error correction prior to the decoding.
 12. The computer readable medium of claim 9, wherein the instructions further comprise: when the result of the multiplication is not equal to zero, performing an error correction prior to the decoding.
 13. The receiver of claim 10, wherein, when the result of the multiplication is not equal to zero, the error correction means performs an error correction prior to the decoding.
 14. The computer-readable medium of claim 9, wherein the instructions further comprise if the result of the multiplication is not equal to zero, performing an error correction by estimating the transmission error, subtracting the estimated error from the received data word, and performing an algebraic decoding of the result of the subtraction.
 15. The computer-readable medium of claim 9, wherein the received data word is determined to be unrecoverable in case number of non-null coefficients of the result of the multiplication exceeds a threshold level.
 16. The computer-readable medium of claim 9, wherein a convolutional code rate is k/n, where n and k are arbitrary integer numbers.
 17. The receiver of claim 10, wherein, if the result of the multiplication is not equal to zero, the error correction means performs an error correction by estimating the transmission error, and subtracts the estimated error from the received data word, and the decoding means performs an algebraic decoding of the result of the subtraction.
 18. The receiver of claim 10, wherein the received data word is determined to be unrecoverable in case number of non-null coefficients of the result of the multiplication exceeds a threshold level.
 19. The receiver of claim 10, wherein a convolutional code rate is k/n, where n and k are arbitrary integer numbers.
 20. A method of decoding a received data word having been transmitted over a radio communication channel, corresponding sent information message having been encoded as a code word, the method comprising: multiplying of the received data word by a parity-check matrix; if the result of the multiplication is zero, performing an algebraic decoding of the received data word without error correction; if the result of the multiplication is not zero, determining whether the received data word is unrecoverable from a number of coefficients obtained from the multiplication; and storing the decoded received data word. 